Rank-Revealing QR Factorizations and the Singular Value Decomposition
نویسندگان
چکیده
منابع مشابه
Rank-Revealing QR Factorizations and the Singular Value Decomposition
T. Chan has noted that, even when the singular value decomposition of a matrix A is known, it is still not obvious how to find a rank-revealing QR factorization (RRQR) of A if A has numerical rank deficiency. This paper offers a constructive proof of the existence of the RRQR factorization of any matrix A of size m x n with numerical rank r. The bounds derived in this paper that guarantee the e...
متن کاملA randomized algorithm for rank revealing QR factorizations and applications
The basic steps of a RRQR Factorization are: (i) select columns from the input matrix A, (ii) permute them to leading positions to a new matrix Ap, (iii) compute a QR Factorization Ap = QR, (iv) reveal rank(A) from R. Since their introduction [1, 2], algorithmic trends have involved procedures for deterministically selecting columns from A [3, 4, 5]. Motivated by recent results in theoretical c...
متن کاملA Fast Implementation of Singular Value Thresholding Algorithm using Recycling Rank Revealing Randomized Singular Value Decomposition
In this paper, we present a fast implementation of the Singular Value Thresholding (SVT) algorithm for matrix completion. A rank-revealing randomized singular value decomposition (RSVD) algorithm is used to adaptively carry out partial singular value decomposition (SVD) to fast approximate the SVT operator given a desired, fixed precision. We extend the RSVD algorithm to a recycling rank reveal...
متن کاملFlip-Flop Spectrum-Revealing QR Factorization and Its Applications on Singular Value Decomposition
We present Flip-Flop Spectrum-Revealing QR (Flip-Flop SRQR) factorization, a significantly faster and more reliable variant of the QLP factorization of Stewart, for low-rank matrix approximations. Flip-Flop SRQR uses SRQR factorization to initialize a partial column pivoted QR factorization and then compute a partial LQ factorization. As observed by Stewart in his original QLP work, Flip-Flop S...
متن کاملA Rank Revealing Randomized Singular Value Decomposition (R3SVD) Algorithm for Low-rank Matrix Approximations
— In this paper, we present a Rank Revealing Randomized Singular Value Decomposition (R 3 SVD) algorithm to incrementally construct a low-rank approximation of a potentially large matrix while adaptively estimating the appropriate rank that can capture most of the actions of the matrix. Starting from a low-rank approximation with an initial guessed rank, R 3 SVD adopts an orthogonal Gaussian sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1992
ISSN: 0025-5718
DOI: 10.2307/2153029